Reformulating Constraint Models Using Input Data

نویسندگان

  • Martin Michalowski
  • Craig A. Knoblock
  • Berthe Y. Choueiry
چکیده

Consider the problem of mapping postal addresses to buildings in satellite imagery using publicly available information, defined as the Building Identification (BID) problem in [1]. This problem takes as input a bounding box that defines the area of a satellite image, buildings identified in the image, vector information that specifies streets in the image, and a set of phone-book entries for the area. The task is to find the set of possible address assignments for each building. In [1], we showed how the task can be framed as a Constraint Satisfaction Problem (CSP), which we solved with an existing solver in [1] and a custom solver in [2]. The CSP is given by P = (V,D, C) where V is the set of buildings, D the set of their respective potential addresses, and C a set of constraints that describe the physical layout of the buildings on the map and address numbering strategies. In the context of a web application, a typical BID scenario is as follows. A user, presented with a map such as a Google map, either selects a specific building in an area of interest and requests the address of the building, or he/she provides an address and requests the buildings that could have this address. This process is repeated for millions of areas throughout the United States. To answer the entire spectrum of user queries, this application needs to contend with the slight addressing variations found in cities across the US. For example, some cities adhere to a block numbering scheme where addresses increment by a fixed factor (i.e., 100 or 1000) across street blocks while others do not. The direction in which addresses increase also varies, in some cities this occurs to the east while in others it is to the west. In other cities, addresses along East-West running streets increase to the West in one part of town but to the East in the other. Finally, expanding this application to support the rest of the world would require the set of constraints to model new addressing characteristics not seen in the US. The globalization of addressing across continents ensures that some general guidelines are followed, but this standardization is typically met with regional/cultural customization such as the districting in Venice or the historical numbering seen in Japan. The creation of individual models, for each city in the

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reformulating Constraint Models for Classical Planning

Constraint satisfaction techniques are commonly used for solving scheduling problems, still they are rare in AI planning. Although there are several attempts to apply constraint satisfaction for solving AI planning problems, these techniques never became predominant in planning; and they never reached the success of, for example, SATbased planners. In this paper we argue that existing constrain...

متن کامل

A new non oriented models for calculating the efficiency of decision-making units in the presence of flexible variables

In assessing the relative efficiency of decision-maker units by classical Data Envelopment Analysis (DEA) models, the status of the data is determined from the input or output points of views. In real issues, there are some data whose statuses are debatable. Some decision making units consider them as input to achieve higher efficiency while some other decision making units consider them ...

متن کامل

Reformulating Positive Table Constraints Using Functional Dependencies

Constraints that are defined by tables of allowed tuples of assignments are common in constraint programming. In this paper we present an approach to reformulating table constraints of large arity into a conjunction of lower arity constraints. Our approach exploits functional dependencies. We study the complexity of finding reformulations that either minimize the memory size or arity of a const...

متن کامل

Efficient DMUs improvement based on input expenses reduction using data envelopment analysis

Network nowadays, the main purpose in the models designed by Data Envelopment Analysis (DEA), is to improve the outputs. In this method which is expressed by Khodabakhshi, with an output oriented BCC model, the output increases when the input increases. In this article we will discuss the efficient Decision Making Units (DMUs) in the input oriented BCC model to reduce the input expenses signifi...

متن کامل

Reformulating Propositional Satissability as Constraint Satisfaction

We study how propositional satissability (SAT) problems can be reformulated as constraint satisfaction problems (CSPs). We analyse four diierent mappings of SAT problems into CSPs. For each mapping , we compare theoretically the performance of systematic algorithms like FC and MAC applied to the encoding against the Davis-Putnam procedure applied to the original SAT problem. We also compare loc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007